Partial clones containing all permutations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partial Clones Containing all Boolean Monotone Self-dual Partial Functions

The study of partial clones on 2 := {0, 1} was initiated by R. V. Freivald. In his fundamental paper published in 1966, Freivald showed, among other things, that the set of all monotone partial functions and the set of all self-dual partial functions are both maximal partial clones on 2. Several papers dealing with intersections of maximal partial clones on 2 have appeared after Freivald work. ...

متن کامل

Short strings containing all k-element permutations

We consider the problem of finding short strings that contain all permutations of order k over an alphabet of size n, with k ≤ n. We show constructively that k(n− 2) + 3 is an upper bound on the length of shortest such strings, for n ≥ k ≥ 10. Consequently, for n ≥ 10, the shortest strings that contain all permutations of order n have length at most n− 2n+ 3. These two new upper bounds improve ...

متن کامل

Shorter strings containing all k - element permutations

We consider the problem of finding short strings that contain all permutations of order k over an alphabet of size n, with k ≤ n. We show constructively that k(n− 2) + 3 is an upper bound on the length of shortest such strings, for n ≥ k ≥ 10. Consequently, for n ≥ 10, the shortest strings that contain all permutations of order n have length at most n− 2n+ 3. These two new upper bounds improve ...

متن کامل

Uncountable Families of Partial Clones Containing Maximal Clones

Let A be a non singleton finite set. We show that every maximal clone determined by a prime affine or h-universal relation on A is contained in a family of partial clones on A of continuum cardinality. MSC 2000: 03B50, 08A40, 08A55

متن کامل

Clones containing all almost unary functions

Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all such clones are finitely generated over the unary functions. In particular, we obtain an explicit description of the only maximal clone in this part of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1995

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700014696